Extending Parikh's Theorem to Weighted and Probabilistic Context-Free Grammars
نویسندگان
چکیده
We prove an analog of Parikh’s theorem for weighted context-free grammars over commutative, idempotent semirings, and exhibit a stochastic context-free grammar with behavior that cannot be realized by any stochastic right-linear context-free grammar. Finally, we show that every unary stochastic context-free grammar with polynomially-bounded ambiguity has an equivalent stochastic right-linear context-free grammar.
منابع مشابه
Parikh’s Theorem for Weighted and Probabilistic Context-Free Grammars
We prove an analog of Parikh’s theorem for weighted context-free grammars over commutative, idempotent semirings, and exhibit a stochastic context-free grammar with behavior that cannot be realized by any stochastic right-linear context-free grammar. Finally, we show that every unary stochastic context-free grammar with polynomially-bounded ambiguity has an equivalent stochastic right-linear co...
متن کاملAn Extension of Parikh's Theorem beyond Idempotence
The commutative ambiguity cambG,X of a context-free grammar G with start symbol X assigns to each Parikh vector v the number of distinct leftmost derivations yielding a word with Parikh vector v. Based on the results on the generalization of Newton’s method to ω-continuous semirings [EKL07b, EKL07a, EKL10], we show how to approximate cambG,X by means of rational formal power series, and give a ...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملThe Generative Power of Probabilistic and Weighted Context-Free Grammars
Over the last decade, probabilistic parsing has become the standard in the parsing literature where one of the purposes of those probabilities is to discard unlikely parses. We investigate the effect that discarding low probability parses has on both the weak and strong generative power of context-free grammars. We prove that probabilistic context-free grammars are more powerful than their non-...
متن کاملBook Reviews The Mathematics of Language
Mathematical linguistics is concerned with the study of mathematical properties of natural languages and linguistic theories. Since the mathematical properties of interest to mathematical linguists are usually from theoretical computer science (complexity classes, language hierarchies, formal learnability), mathematical linguistics can be considered to be an area of theoretical computational li...
متن کامل